computationally feasible

вычислительно осуществимый

English-Russian cryptological dictionary . 2014.

Смотреть что такое "computationally feasible" в других словарях:

  • cryptology — cryptologist, n. cryptologic /krip tl oj ik/, cryptological, adj. /krip tol euh jee/, n. 1. cryptography. 2. the science and study of cryptanalysis and cryptography. [1635 45; < NL cryptologia. See CRYPTO , LOGY] * * * Introduction …   Universalium

  • Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and …   Wikipedia

  • Multiscale modeling — In engineering, mathematics, physics, meteorology and computer science, multiscale modeling is the field of solving physical problems which have important features at multiple scales, particularly multiple spatial and(or) temporal scales.… …   Wikipedia

  • Gibbs sampling — In statistics and in statistical physics, Gibbs sampling or a Gibbs sampler is an algorithm to generate a sequence of samples from the joint probability distribution of two or more random variables. The purpose of such a sequence is to… …   Wikipedia

  • Partially observable Markov decision process — A Partially Observable Markov Decision Process (POMDP) is a generalization of a Markov Decision Process. A POMDP models an agent decision process in which it is assumed that the system dynamics are determined by an MDP, but the agent cannot… …   Wikipedia

  • Combinatorial meta-analysis — (CMA) is the study of the behaviour of statistical properties of combinations of studies from a meta analytic dataset (typically in social science research). In an article that develops the notion of gravity in the context of meta analysis, Dr.… …   Wikipedia

  • Speech recognition — For the human linguistic concept, see Speech perception. The display of the Speech Recognition screensaver on a PC, in which the character responds to questions, e.g. Where are you? or statements, e.g. Hello. Speech recognition (also known as… …   Wikipedia

  • DTIME — In computational complexity theory, DTIME (or TIME) is the computational resource of computation time for a deterministic Turing machine. It represents the amount of time (or number of computation steps) that a normal physical computer would take …   Wikipedia

  • Data assimilation — Applications of data assimilation arise in many fields of geosciences, perhaps most importantly in weather forecasting and hydrology. Data assimilation proceeds by analysis cycles. In each analysis cycle, observations of the current (and possibly …   Wikipedia

  • Minimax — This article is about the decision theory concept. For other uses, see Minimax (disambiguation). Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss for a… …   Wikipedia

  • Julia set — In complex dynamics, the Julia set J(f), [Note that in other areas of mathematics the notation J(f), can also represent the Jacobian matrix of a real valued mapping f, between smooth manifolds.] of a holomorphic function f, informally consists of …   Wikipedia

Книги

Другие книги по запросу «computationally feasible» >>

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.